A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors
نویسندگان
چکیده
A tabular method for verification of data exchange algorithms on networks which possess a certain symmetry (whose underlying graph is a Cayley graph) is given. The algorithms use no intermediate buffering of messages. To illustrate this method, optimal total exchange (i.e., all-to-all personalised) algorithms are given for several much-used processor configurations, such as ring networks, the hypercube and symmetric meshes with wrap-around (two and threedimensional). To the best of our knowledge the latter are new. ACM CCS
منابع مشابه
Speeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملStatic Task Allocation in Distributed Systems Using Parallel Genetic Algorithm
Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...
متن کاملUsing Neural Networks and Genetic Algorithms for Modelling and Multi-objective Optimal Heat Exchange through a Tube Bank
In this study, by using a multi-objective optimization technique, the optimal design points of forced convective heat transfer in tubular arrangements were predicted upon the size, pitch and geometric configurations of a tube bank. In this way, the main concern of the study is focused on calculating the most favorable geometric characters which may gain to a maximum heat exchange as well as a m...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Nord. J. Comput.
دوره 1 شماره
صفحات -
تاریخ انتشار 1994